翻訳と辞書 |
Okamoto–Uchiyama cryptosystem : ウィキペディア英語版 | Okamoto–Uchiyama cryptosystem The Okamoto–Uchiyama cryptosystem was discovered in 1998 by Tatsuaki Okamoto and Shigenori Uchiyama. The system works in the multiplicative group of integers modulo n, , where ''n'' is of the form ''p''2''q'' and ''p'' and ''q'' are large primes. ==Scheme definition==
Like many public key cryptosystems, this scheme works in the group . A fundamental difference of this cryptosystem is that here ''n'' is a of the form ''p''2''q'', where ''p'' and ''q'' are large primes. This scheme is homomorphic and hence malleable.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Okamoto–Uchiyama cryptosystem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|